Speeding Up the Partial Digest Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up the ESG Algorithm

Local search (LS) methods heuristically find a solution for constraint satisfaction problems (CSP). LS starts the search for a solution from a random assignment. LS then examines the neighbours of this assignment to determine a better neighbour valuation to move to. It repeats this process of moving from the current assignment to a better assignment until it finds a solution that satisfies all ...

متن کامل

Speeding up the Symbolic Multilevel Algorithm

This paper describes two recent improvements to the symbolic multilevel algorithm. Firstly, it is shown how to use precalculations for the aggregation process of the matrix. Secondly, faster vector aggregation/disaggregation routines using precalculated indices are presented. Experiments show the practical use of these changes.

متن کامل

Speeding up the Parti-Game Algorithm

In this paper, we introduce an efficient replanning algorithm for nondeterministic domains, namely what we believe to be the first incremental heuristic minimax search algorithm. We apply it to the dynamic discretization of continuous domains, resulting in an efficient implementation of the parti-game reinforcement-learning algorithm for control in high-dimensional domains.

متن کامل

Speeding up the Java Tm Serialisation Framework through Partial Evaluation

Framework-based Object-Oriented applications are not as eecient as they could be. This results from the high-genericity of frameworks. However, once the framework is instantiated, part of this genericity can be removed. This is for instance the case when gener-icity is obtained through the use of reeection. This paper takes the Java Serialization framework as a typical example and shows how par...

متن کامل

Speeding-up Image Encoding times in the SPIHT Algorithm

In this paper, a new approach (scheme) to the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. During the pre-scanning phase, the proposed scheme generates problem-oriented binary codes for the whole set of quad-tree roots (wavelet coefficients) and thereby accumulates information on the significance of respective descendants (wavelet coefficients comprisi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Informatics and Mathematical Sciences

سال: 2018

ISSN: 0974-875X,0975-5748

DOI: 10.26713/jims.v10i1-2.611